n = int(input())
left = []
right = []
num = [i for i in range(n)] ans = [0] *n
for _ in range(n):
l, r = map(int, input().split())
left.append(l)
right.append(r)
num.sort(key=lambda x: right[x])
for i in range(n):
idx = num[i] while left[idx] <= right[idx]:
ok = True
for j in range(n):
if ans[j] == left[idx]:
ok = False
break
if ok:
break
left[idx] += 1
ans[idx] = left[idx]
print(*ans)
921. Minimum Add to Make Parentheses Valid | 881. Boats to Save People |
497. Random Point in Non-overlapping Rectangles | 528. Random Pick with Weight |
470. Implement Rand10() Using Rand7() | 866. Prime Palindrome |
1516A - Tit for Tat | 622. Design Circular Queue |
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |